Linear complexity of quaternary sequences over Z4 based on Ding-Helleseth generalized cyclotomic classes
نویسندگان
چکیده
A family of quaternary sequences over Z4 is defined based on the DingHelleseth generalized cyclotomic classes modulo pq for two distinct odd primes p and q. The linear complexity is determined by computing the defining polynomial of the sequences, which is in fact connected with the discrete Fourier transform of the sequences. The results show that the sequences possess large linear complexity and are “good” sequences from the viewpoint of cryptography.
منابع مشابه
Linear Complexity of Quaternary Sequences Over Z4 Derived From Generalized Cyclotomic Classes Modulo 2p
We determine the exact values of the linear complexity of 2pperiodic quaternary sequences over Z4 (the residue class ring modulo 4) defined from the generalized cyclotomic classes modulo 2p in terms of the theory of of Galois rings of characteristic 4, where p is an odd prime. Compared to the case of quaternary sequences over the finite field of order 4, it is more difficult and complicated to ...
متن کاملOn the Linear Complexity of Ding-Helleseth Generalized Cyclotomic Binary Sequences of Order Four and Six
We propose a new computation method for the linear complexity and the minimal polynomial of Ding-Helleseth-generalized cyclotomic sequences. We will find the linear complexity of DingHelleseth-generalized cyclotomic sequences of order four and six and make the results of Tongjiang Yan et. al [19] about the sequences of order four more specific. 2010 Mathematics Subject Classifications: 11B50, 9...
متن کاملUsing of Generalized Cyclotomy for Sequence Design over the Finite Field of Order Four with High Linear Complexity
We consider the use of generalized Ding-Helleseth cyclotomy to design sequences over the finite field of order four. Using generalized cyclotomic classes of order four we obtain the family of balanced sequences of odd period with high linear complexity. Also we present a method of constructing sequences with high linear complexity and arbitrary even period over the finite field of order four. T...
متن کاملLinear Complexity of Ding-Helleseth Generalized Cyclotomic Binary Sequences of Any Order
This paper gives the linear complexity of binary Ding-Helleseth generalized cyclo-tomic sequences of any order.
متن کاملAbout the Linear Complexity of Ding-Hellesth Generalized Cyclotomic Binary Sequences of Any Period
We defined sufficient conditions for designing Ding-Helleseth sequences with arbitrary period and high linear complexity for generalized cyclotomies. Also we discuss the method of computing the linear complexity of Ding-Helleseth sequences in the general case.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1711.08216 شماره
صفحات -
تاریخ انتشار 2017